CONTINUITY OF A QUEUEING INTEGRAL REPRESENTATION IN THE M 1 TOPOLOGY By Guodong Pang and Ward Whitt
نویسندگان
چکیده
0 h(y(s)) ds, t ≥ 0, mapping a function x into a function y, when the underlying function space D is endowed with the Skorohod M1 topology. We apply this integral representation with the continuous mapping theorem to establish heavy-traffic stochastic-process limits for many-server queueing models when the limit process has jumps unmatched in the converging processes, as can occur with bursty arrival processes or service interruptions. The proof of M1continuity is based on a new characterization of the M1 convergence, in which the time portions of the parametric representations are absolutely continuous with respect to Lebesgue measure, and the derivatives are uniformly bounded and converge in L1.
منابع مشابه
Continuity of a Queueing Integral Representation in the M 1 Topology
We establish continuity of the integral representation y(t) = x(t) + ∫ t 0 h(y(s)) ds, t ≥ 0, mapping a function x into a function y when the underlying function space D is endowed with the Skorohod M1 topology. We apply this integral representation with the continuous mapping theorem to establish heavy-traffic stochastic-process limits for many-server queueing models when the limit process has...
متن کاملHeavy-traffic limits for many-server queues with service interruptions
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process where the limit is an ordinary differential equation in a two-state random environment. With asymptotically negligible service interru...
متن کاملHeavy-traffic extreme value limits for Erlang delay models
We consider the maximum queue length and the maximum number of idle servers in the classical Erlang delay model and the generalization allowing customer abandonment—the M/M/n+M queue. We use strong approximations to show, under regularity conditions, that properly scaled versions of the maximum queue length and maximum number of idle servers over subintervals [0, t] in the delay models converge...
متن کاملProbability ERGODIC CONTROL OF MULTI - CLASS M / M / N + M QUEUES IN THE HALFIN - WHITT REGIME
We study a dynamic scheduling problem for a multi-class queueing network with a large pool of statistically identical servers. The arrival processes are Poisson, and service times and patience times are assumed to be exponentially distributed and class dependent. The optimization criterion is the expected long time average (ergodic) of a general (non-linear) running cost function of the queue l...
متن کاملInfinite Horizon Average Optimality of the N-network Queueing Model in the Halfin-Whitt Regime
We study the infinite horizon optimal control problem for N-network queueing systems, which consist of two customer classes and two server pools, under average (ergodic) criteria in the Halfin–Whitt regime. We consider three control objectives: 1) minimizing the queueing (and idleness) cost, 2) minimizing the queueing cost while imposing a constraint on idleness at each server pool, and 3) mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009